An algorithm for finding input–output constrained convex sets in an acyclic digraph
نویسندگان
چکیده
منابع مشابه
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph
A set X of vertices of an acyclic graph is convex if any vertex on a directed path between elements of X is itself in X. We construct an algorithm for generating all input-output constrained convex (IOCC) sets in an acyclic digraph, which uses several novel ideas. We show that our algorithm is more efficient than algorithms described in the literature in both the worst case and computational ex...
متن کاملApproximate Algorithm for Finding maximum upward emeddable sub - digraph of an acyclic
Graphs appear as simplified representations of a diversity of real-world structures. Naturally there is a question of an intrinsic graph metric, often presumed to be the “shortestpath” metric. Other plausible possibilities for intrinsic graph metrics are formulated in terms of the (combinatorial) Laplacian matrix of the graph, as well as in terms of other combinatoric, probabilistic, and physic...
متن کاملAn Algorithm for Finding Connected Convex Subgraphs of an Acyclic Di- graph
A subgraph H of an acyclic digraph D is convex if there is no directed path between vertices of H which contains an arc not in H. A digraph D is connected if the underlying undirected graph of D is connected. We construct an algorithm for enumeration of all connected convex subgraphs of a connected acyclic digraph D of order n. The time complexity of the algorithm is O(n · cc(D)), where cc(D) i...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولConvex Sets in Acyclic Digraphs
A non-empty set X of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by X is connected and it is called convex if no two vertices of X are connected by a directed path in which some vertices are not in X. The set of convex sets (connected convex sets) of an acyclic digraph D is denoted by CO(D) (CC(D)) and its size by co(D) (cc(D)). Gutin, Johnstone...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.02.002